Model checking for coalition announcement logic
نویسندگان
چکیده
منابع مشابه
Coalition and Group Announcement Logic
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other’s knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and Coalition Announcement Logic. They allow us to reason about what groups of agents can achieve through joint announcements in non-competitive and competitive ...
متن کاملTractable model checking for fragments of higher-order coalition logic
A number of popular logical formalisms for representing and reasoning about the abilities of teams or coalitions of agents have been proposed beginning with the Coalition Logic (CL) of Pauly. Ågotnes et al introduced a means of succinctly expressing quantification over coalitions without compromising the computational complexity of model checking in CL by introducing Quantified Coalition Logic ...
متن کاملTemporal Logic Model Checking
ion reduces the state space by removing irrelevant features of a Kripke structure. Given a Kripke structure K, an abstraction is a Kripke structure K̂ such that K̂ is significantly smaller than K, and K̂ preserves a useful class of specifications for K. Consequently, the expensive task of model checking K can be reduced to the more feasible task of model checking K̂. We know from above that in orde...
متن کاملModel Checking Coalition Logic on Implicit Models is ∆ P 3 - complete
In this note we show that model checking Coalition Logic over Concurrent Game Structures in which the transition function is given implicitly by a set of Boolean formulae is ∆3 -complete.
متن کاملTableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In this article we propose a labelled tableau calculus for this logic, and show that it decides satisfiability of formulas in deterministic polynomial space. Since this problem is known to be PSPACE-complete, it follows that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Investigations
سال: 2018
ISSN: 2413-2713,2074-1472
DOI: 10.21146/2074-1472-2018-24-2-59-69